Log Depth Circuits for Division and Related Problems
نویسندگان
چکیده
منابع مشابه
Log Depth Circuits for Division and Related Problems
We present optimal depth Boolean circuits (depth O(log n)) for integer division, powering and multiple products We also show tha t these three problems are of equivalent uniform depth and space complexity In addition, we describe an algorithm for testing drvisibility tha t is optimal for both depth and space
متن کاملDepth efficient neural networks for division and related problems
An artificial neural network (ANN) is commonly modeled by a threshold circuit, a network of interconnected processing units called linear threshold gates. The depth of a circuit represents the number of unit delays or the time for parallel computation. The size of a circuit is the number of gates and measures the amount of hardware. It was known that traditional logic circuits consisting of onl...
متن کاملMin-Rank Conjecture for Log-Depth Circuits
A completion of an m-by-n matrix A with entries in {0, 1, ∗} is obtained by setting all ∗-entries to constants 0 or 1. A system of semi-linear equations over GF2 has the form Mx = f(x), where M is a completion of A and f : {0, 1}n → {0, 1}m is an operator, the ith coordinate of which can only depend on variables corresponding to ∗-entries in the ith row of A. We conjecture that no such system c...
متن کاملUniform Circuits for Division: Consequences and Problems
Integer division has been known to lie in P-uniform TC since the mid1980’s, and recently this was improved to L-uniform TC. At the time that the results in this paper were proved and submitted for conference presentation, it was unknown whether division lay in DLOGTIME-uniform TC (also known as FOM). We obtain tight bounds on the uniformity required for division, by showing that division is com...
متن کاملUniform constant-depth threshold circuits for division and iterated multiplication
It has been known since the mid-1980's [15, 46, 47] that integer division can be performed by poly-time uniform constant-depth circuits of Majority gates; equivalently, the division problem lies in P-uniform TC 0. Recently this was improved to L-uniform TC 0 [19], but it remained unknown whether division can be performed by DLOGTIME-uniform TC 0 circuits. The DLOGTIME uniformity condition is re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1986
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0215070